Use of timed automata and model-checking to explore scenarios on ecosystem models
نویسندگان
چکیده
The interest to build ecosystem models is well acknowledged in order to improve the understanding of the sophisticated linkages between humans and natural species embedded within variable local and global environmental contexts. It is especially true when a complex temporal evolution intervenes as in population regulations. Ecological modellers usually resort to numerical models supported by accurate data and extensive knowledge on biological processes. Unfortunately, the task becomes more difficult to model ecosystems with limited data and knowledge. Qualitative models may be more suitable for designing data-poor systems in a decision-aid context. We propose a new qualitative approach for ecosystem modelling based on timed automata (TA) formalism combined with a high-level query language for exploring scenarios. TA rely on a discrete-event system formalism to reproduce the temporal dynamics of a system. Combined with model-checking techniques, TA enable the exploration of system properties in response to a wide range of scenarios based on a temporal logic. Our applicative case concerns the evolution of different fish biomass along time according to fishing policies, especially when exogenous environmental issues may also be considered. We have developed this approach to model a simplified marine ecosystem subject to different fishing policies. Using predefined query patterns, we show that TA and model-checking are relevant tools to query timed properties of a fishery system in response to different management options. This modelling approach may be especially useful for fostering better discussion among all stakeholders involved in fisheries management. ! 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
0 M ay 2 00 8 MODEL CHECKING ONE - CLOCK PRICED TIMED AUTOMATA PATRICIA
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class ...
متن کاملA Space-eecient On-the--y Algorithm for Real-time Model Checking
In temporal-logic model checking, we verify the correctness of a program with respect to a desired behavior by checking whether a structure that models the program satisses a temporal-logic formula that speciies the behavior. The main practical limitation of model checking is caused by the size of the state space of the program, which grows exponentially with the number of concurrent components...
متن کاملcient On - the - y Algorithm for Real - Time Model Checking
In temporal-logic model checking, we verify the correctness of a program with respect to a desired behavior by checking whether a structure that models the program satis es a temporal-logic formula that speci es the behavior. The main practical limitation of model checking is caused by the size of the state space of the program, which grows exponentially with the number of concurrent components...
متن کاملModel-Checking One-Clock Priced Timed Automata
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class ...
متن کاملChecking MTL Properties of Discrete Timed Automata via Bounded Model Checking
We investigate a SAT-based bounded model checking (BMC) method for MTL (metric temporal logic) that is interpreted over linear discrete infinite time models generated by discrete timed automata. In particular, we translate the existential model checking problem for MTL to the existential model checking problem for a variant of linear temporal logic (called HLTL), and we provide a SAT-based BMC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Environmental Modelling and Software
دوره 30 شماره
صفحات -
تاریخ انتشار 2012